Concurrency Control Protocols for Persistent Shared Virtual Memory Systems (Extended Abstract)
نویسندگان
چکیده
A family of optimistic concurrency control protocols for real-time persistent systems with critical performance requirements and very tight deadlines is proposed. Under assumptions that almost all transactions are extremely short and read-only and the entire database resides in main memory (which are realistic for this type of applications), we propose distributed concurrency control protocols which exploit the virtual memory management for concurrency control. Virtual memory management is required anyway, so the additional overhead is extremely low, especially for most frequent read-only transactions. Two variations of the proposed protocol are described and compared with alternative approaches.
منابع مشابه
Supporting STM in Distributed Systems: Mechanisms and a Java Framework
We present HyFlow — a distributed software transactional memory (D-STM) framework for distributed concurrency control. Lockbased concurrency control suffers from drawbacks including deadlocks, livelocks, and scalability and composability challenges. These problems are exacerbated in distributed systems due to their distributed versions which are more complex to cope with (e.g., distributed dead...
متن کاملOperating System Support for Flexible Coherence in Distributed Shared Memory
COMMOS1 is an operating system architecture developed to support shared persistent data objects in distributed systems. This paper describes its support for flexible coherence. The approach is based on a microkernel, typed memory objects and integrated coherence control. The coherence server is clearly separated from the external pager. This separation makes it easier to provide multiple cohere...
متن کاملVirtual Differential Storage Based K - Rollback Concurrency Control Algorithm in Distributed Shared Memory Systems
52 Abstract— Most of the algorithms that exist today for concurrency control over distributed shared memory, either fail to provide a scalable model or involve a large communication overhead for establishing consensus over the state of the shared variables. After a thorough study of some of the efficient algorithms this field, this paper introduces a functional view of a holistic approach, whic...
متن کاملSequential Consistency in Distributed Systems
Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simpliies programming. It has been shown that many practical applications using DSMs require competing operations. We have aimed at unifying theory and implementations of protocols for sequential consistency, which provides competing operations. By adopting concepts from concurrency contro...
متن کاملVirtual memory support for distributed computing environments using a shared data object model
Conventional storage management systems provide one interface for accessing memory segments and another for accessing secondary storage objects. This hinders application programming and affects overall system performance due to mandatory data copying and userlkernel boundary crossings, which in the microkernel case may involve context switches. Memoly-mapping techniques may be used to provide p...
متن کامل